Hierarchies and Characterizations of Stateless Multicounter Machines
نویسندگان
چکیده
We investigate the computing power of stateless multicounter machines with reversal-bounded counters. Such a machine can be deterministic, nondeterministic, realtime (the input head moves right at every step), or non-realtime. The deterministic realtime stateless multicounter machines has been studied elsewhere [1]. Here we investigate non-realtime machines in both deterministic and nondeterministic cases with respect to the number of counters and reversals. We also consider closure properties and relate the models to stateless multihead automata and show that the bounded languages accepted correspond exactly to
منابع مشابه
On Stateless Multicounter Machines
We investigate the computing power of stateless multicounter machines with reversal-bounded counters. Such a machine has m-counters and it operates on a one-way input delimited by left and right end markers. The move of the machine depends only on the symbol under the input head and the signs of the counters (zero or positive). At each step, every counter can be incremented by 1, decremented by...
متن کاملStateless multicounter 5′ → 3′ Watson-Crick automata
The model we consider are stateless counter machines which mix the features of one-head counter machines and special two-head Watson-Crick automata (WK-automata). These biologically motivated machines have reading heads that read the input starting from the two extremes. The reading process is finished when the heads meet. The machine is realtime or non-realtime depending on whether the heads a...
متن کاملHierarchies of Stateless Multicounter 5′ → 3′ Watson-Crick Automata Languages
We consider stateless counter machines which mix the features of one-head counter machines and a special type of two-head Watson-Crick automata (WK-automata). Our Watson-Crick counter machines are biologically motivated. They have two heads that read the input starting from the two extremes. The reading process is finished when there are no more symbols between the heads, i.e., every letter of ...
متن کاملHierarchy Results on Stateless Multicounter 5′ → 3′ Watson-Crick Automata
We consider stateless counter machines which mix the features of one-head counter machines and a special type of two-head Watson-Crick automata (WK-automata). Our biologically motivated machines have heads that read the input starting from the two extremes. The reading process is finished when there are no more symbols between the heads. Depending on whether the heads are required to advance at...
متن کاملA Survey of Results on Stateless Multicounter Automata
A stateless multicounter machine has m-counters operating on a one-way input delimited by left and right end markers. A move of the machine depends only on the symbol under the input head and the sign pattern of the counters. An input string is accepted if, when the input head is started on the left end marker with all counters zero, the machine eventually reaches the configuration where the in...
متن کامل